# 验证 4 ~ 100 哥德巴赫猜想成立

import math

def isPrime(n):
    if n == 2 or n == 3:
        return True
    else:
        i = 2
        while i <= math.sqrt(n):
            if n % i == 0:
                return False
            i += 1
        return True
def find(n):
    i = 2
    while i <= n / 2:
        if isPrime(i) and isPrime(n - i):
            return i
        i += 1

i = 2
count = 0
while 2 * i < 100:
    if count % 5 != 4:
        print("{:2}={:2}+{:2}\t".format(2 * i, find(2 * i), 2 * i - find(2 * i)), end="")
    else:
        print("{:2}={:2}+{:2}\t".format(2 * i, find(2 * i), 2 * i - find(2 * i)))
    count += 1
    i += 1